Computational Data Structures for High-Performance Complex Network-Based Small-World Simulations
نویسندگان
چکیده
The Watts and Strogatz model of small-world network systems has been successfully applied to explain features in several data sets. We have carried out a set of extensive simulation studies of stochastically generated small-world systems. We report on the data structures, memory and run-time complexity of our simulation codes and discuss how these ideas may be applied to similar simulations studies. Our packed k-index mechanism encodes physical spatial information and supports interpolation between pure list and multi-dimensional array models. The k-index mechanism allows most procedures in simulations of this ilk to be written in a dimensionally independent fashion.
منابع مشابه
Link Prediction using Network Embedding based on Global Similarity
Background: The link prediction issue is one of the most widely used problems in complex network analysis. Link prediction requires knowing the background of previous link connections and combining them with available information. The link prediction local approaches with node structure objectives are fast in case of speed but are not accurate enough. On the other hand, the global link predicti...
متن کاملAn Integrated Approach for Measuring Performance of Network structure: Case study on power plants
Data envelopment analysis (DEA) and balanced scorecard (BSC) are two well-known approaches for measuring performance of decision making units (DMUs). BSC is especially applied with quality measures, whereas, when the quantity measures are used to evaluate, DEA is more appropriate. In the real-world, DMUs usually have complex structures such as network structures. One of the well-known network s...
متن کاملComputational Data Structures for Lattice-Based Small-World Simulations
The Watts and Strogatz model of small-world network systems has been successfully applied to explain features in several data sets. We have carried out a set of extensive simulation studies of stochastically generated small-world systems. We report on the data structures, memory and run-time complexity of our simulation codes and discuss how these ideas may be applied to similar simulations stu...
متن کاملReliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)
Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...
متن کاملA METAHEURISTIC-BASED ARTIFICIAL NEURAL NETWORK FOR PLASTIC LIMIT ANALYSIS OF FRAMES
Despite the advantages of the plastic limit analysis of structures, this robust method suffers from some drawbacks such as intense computational cost. Through two recent decades, metaheuristic algorithms have improved the performance of plastic limit analysis, especially in structural problems. Additionally, graph theoretical algorithms have decreased the computational time of the process impre...
متن کامل